LOCAL PERMUTATION POLYNOMIALS IN THREE VARIABLES OVER Zp

نویسنده

  • GARY L. MULLEN
چکیده

If p is a prime, let Zp denote the integers modulo p and Z* the set of nonzero elements of Zp. It is well known that every function from Zp x Zp x Zp into Zp can be represented as a polynomial of degree < p in each variable. We say that a polynomial f(x19 x29 x3) with coefficients in Zp is a local permutation polynomial in three variables over Zp if f(x19a9 b) 9 f{c9x29 d) , and f(e9f9 x$) are permutations in x±9 x2, and x3, respectively, for all a, b9 c9 d9 e 9 f e Zp. A general theory of local permutation polynomials in n variables will be discussed In a subsequent paper. In an earlier paper [2], we considered polynomials in two variables over Zp and found necessary and sufficient conditions on the coefficients of a polynomial in order that it represents a local permutation polynomial in two variables over Zp. The number of Latin squares of order p wds thus equal to the number of sets of coefficients satisfying the conditions given in [2]. In this paper, we consider polynomials in three variables over Zp and again determine necessary and sufficient conditions on the coefficients of a polynomial in order that it represents a local permutation polynomial in three variables over Zp. As in [1], a Latin cube of order n is defined as an n x n x n cube consisting of n rows, n columns, and n levels in which the numbers 0, 1, ..., n 1 are entered so that each number occurs exactly once in each row, column, and level. Clearly the number of Latin cubes of order p equals the number of local permutation polynomials in three variables over Zp. We say that a Latin cube is reduced if row one, column one, and level one are in the form 0, 1, ..., n 1. The number of reduced Latin cubes of order p will equal the number of sets of coefficients satisfying the set of conditions given in Section 2. In Section 3, we use our theory to show that there is only one reduced local permutation polynomial in three variables over Z3 and, thus, there is precisely one reduced Latin cube of order three.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finiteness results for regular ternary quadratic polynomials

In 1924, Helmut Hasse established a local-to-global principle for representations of rational quadratic forms. Unfortunately, an analogous local-to-global principle does not hold for representations over the integers. A quadratic polynomial is called regular if such a principle exists; that is, if it represents all the integers which are represented locally by the polynomial itself over Zp for ...

متن کامل

On the degree of local permutation polynomials∗

Every Latin square of prime or prime power order s corresponds to a polynomial in 2 variables over the finite field on s elements, called the local permutation polynomial. What characterizes this polynomial is that its restrictions to one variable are permutations. We discuss the general form of local permutation polynomials and prove that their total degree is at most 2s−4, and that this bound...

متن کامل

On the class of square Petrie matrices induced by cyclic permutations

Let n≥ 2 be an integer and let P = {1,2, . . . ,n,n+1}. Let Zp denote the finite field {0,1,2, . . . , p−1}, where p ≥ 2 is a prime. Then every map σ on P determines a real n×n Petrie matrix Aσ which is known to contain information on the dynamical properties such as topological entropy and the Artin-Mazur zeta function of the linearization of σ . In this paper, we show that if σ is a cyclic pe...

متن کامل

Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x) + x induce permutations of the field, which has combin...

متن کامل

Five Constructions of Permutation Polynomials over $\gf(q^2)$

Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010